Ranks of Incidence Matrices of t-designs Sλ(t, t+1, v)
نویسندگان
چکیده
منابع مشابه
Enumeration of t-Designs Through Intersection Matrices
In this paper, we exploit some intersection matrices to empower a backtracking approach based on Kramer–Mesner matrices. As an application, we consider the interesting family of simple t-ðtþ 8; tþ 2; 4Þ designs, 1 t 4, and provide a complete classification for t 1⁄4 1; 4, as well as a classification of all non-rigid designs for t 1⁄4 2; 3. We also enumerate all rigid designs for t 1⁄4 2. The co...
متن کاملIncidence graphs constructed from t-designs
Let D be a non-trivial simple t-design. For 1 ≤ s ≤ t, we generalize the concept of the incidence graph of D and construct a new bipartite regular graph Γ. We obtain that the edge-transitivity of the graph Γ is equivalent to the s-flag-transitivity of the design D. We then, for s = 2, classify the semisymmetric graphs among the graphs Γ constructed from biplanes and triplanes. Finally, we study...
متن کاملRanks of Random Matrices and Graphs
OF THE DISSERTATION Ranks of Random Matrices and Graphs by Kevin Costello Dissertation Director: Van Vu Let Qn be a random symmetric matrix whose entries on and above the main diagonal are independent random variables (e.g. the adjacency matrix of an Erdős-Rényi random graph). In this thesis we study the behavior of the rank of the matrix in terms of the probability distribution of the entries....
متن کاملRanks and signatures of adjacency matrices
Two simple operations on graphs (deleting isolated vertices, and identifying vertices with the same neighbour sets) do not change the rank and signature of the adjacency matrix. Moreover, for any given rank, there are only finitely many reduced graphs (those in which distinct vertices have distinct neighbour sets) of any given rank. It follows that any graph parameter which is unchanged by the ...
متن کاملRanks of matrices with few distinct entries
An L-matrix is a matrix whose off-diagonal entries belong to a set L, and whose diagonal is zero. Let N(r, L) be the maximum size of a square L-matrix of rank at most r. Many applications of linear algebra in extremal combinatorics involve a bound on N(r, L). We review some of these applications, and prove several new results on N(r, L). In particular, we classify the sets L for which N(r, L) i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1980
ISSN: 0195-6698
DOI: 10.1016/s0195-6698(80)80044-8